A Class of Infinite Convex Geometries
نویسندگان
چکیده
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and spatial. Some classes of examples of such convex geometries are given.
منابع مشابه
A numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملStrongly almost ideal convergent sequences in a locally convex space defined by Musielak-Orlicz function
In this article, we introduce a new class of ideal convergent sequence spaces using an infinite matrix, Musielak-Orlicz function and a new generalized difference matrix in locally convex spaces. We investigate some linear topological structures and algebraic properties of these spaces. We also give some relations related to these sequence spaces.
متن کاملA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
In this paper we present a duality between nonmonotonic consequence relations and well-founded convex geometries. On one side of the duality we consider nonmonotonic consequence relations satisfying the axioms of an infinitary variant of System P, which is one of the most studied axiomatic systems for nonmonotonic reasoning, conditional logic and belief revision. On the other side of the dualit...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016